A subdifferential characterization of Motzkin decomposable functions

The Directed Subdifferential of DC Functions

The space of directed sets is a Banach space in which convex compact subsets of Rn are embedded. Each directed set is visualized as a (nonconvex) subset of Rn, which is comprised of a convex, a concave and a mixed-type part. Following an idea of A. Rubinov, the directed subdifferential of a difference of convex (DC) functions is defined as the directed difference of the corresponding embedded c...

a contrastive study of rhetorical functions of citation in iranian and international elt scopus journals

writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...

Filtering Decomposable Global Cost Functions

As (Lee and Leung 2012) have shown, weighted constraint satisfaction problems can benefit from the introduction of global cost functions, leading to a new Cost Function Programming paradigm. In this paper, we explore the possibility of decomposing global cost functions in such a way that enforcing soft local consistencies on the decomposition achieves the same level of consistency on the origin...

A characterization of triple semigroup of ternary functions and Demorgan triple semigroup of ternary functions

Efficient Minimization of Decomposable Submodular Functions

Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time. Unfortunately, state-of-the-art algorithms for general submodular minimization are intractable for larger problems. In this paper, we introduce a novel ...